#include <stdio.h>
#include <stdlib.h>

#if 1
#define MIN_R       1       /* in millimeters */
#define MAX_R       10000   /* 1 km */
#define MAX_COOR    10000   /* +/- 1km */
#define CASES       1000
#else
#endif

int gen_int(int minv, int maxv)
{
    int k = ((rand() << 16) ^ rand()) & 0x7fffffff;
    return minv + k % (maxv - minv + 1);
}

#define abs(x) ((x) < 0 ? -(x) : (x))

/* The following conditions are met for the input data: 
 * - The discs centers are not all collinear.
 * - The discs are totally disjoint.
 * - The discs are transparent and non-refractive. That is, a disc is visible
 *   and has the same apparent shape and size, whether or not there's another
 *   disc in front of it.
 * - The input data are such that the existence or non-existence of such a 
 *   point is computable, even with slight rounding error.
 */

int main()
{
    int t;
    for (t = 0; t < CASES; )
    {
        int skip = 0;
        int x[3], y[3], r[3], i;
        for (i = 0; i < 3; i++)
        {
            x[i] = gen_int(-MAX_COOR, MAX_COOR);
            y[i] = gen_int(-MAX_COOR, MAX_COOR);
            r[i] = gen_int(MIN_R, MAX_R);
        }
        
        /* Check if the centers are colinear. */
        if ((long long)(y[1]-y[0])*(x[2]-x[1]) == 
            (long long)(y[2]-y[1])*(x[1]-x[0]))
            continue;

        /* Check if any two circles intersect. */
        for (i = 0; i < 3; i++)
        {
            long long x1 = x[(i+0)%3], y1 = y[(i+0)%3], r1 = r[(i+0)%3];
            long long x2 = x[(i+1)%3], y2 = y[(i+1)%3], r2 = r[(i+1)%3];
            long long d2 = (long long)(x2-x1)*(x2-x1) + 
                           (long long)(y2-y1)*(y2-y1);
            if (d2 <= (r1+r2)*(r1+r2))
                skip = 1;
        }
        if (skip)
            continue;

        for (i = 0; i < 3; i++)
        {
            printf("%d.%03d %d.%03d %d.%03d ",
                   x[i] / 1000, abs(x[i]) % 1000,
                   y[i] / 1000, abs(y[i]) % 1000,
                   r[i] / 1000, abs(r[i]) % 1000);
        }
        printf("\n");
        t++;
    }
    return 0;
}
